Euler tangent numbers modulo 720 and Genocchi numbers modulo 45

نویسندگان

چکیده

We establish congruences for higher order Euler polynomials modulo 720. apply this result constructing analogues of Stern secant numbers $E_{4n}\equiv 5(\mathrm{mod}\ 60), E_{4n+2}\equiv -1(\mathrm{mod}\ 60)$ to tangent and Genocchi numbers. prove that satisfy the following $E_{4n+1}\equiv 16(\mathrm{mod}\ 720)$, $E_{4n+3}\equiv -272(\mathrm{mod}\ 720)$. 12-periodic property 45.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Euler Numbers modulo 2

Let {En} be the Euler numbers. In the paper we give a general congruence modulo 2(m+2)n involving for Eb and for E2mk+b, where k, m, n are positive integers and b ∈ {0, 2, 4, . . .}. MSC: Primary 11B68, Secondary 11A07

متن کامل

On Euler Numbers modulo Powers of Two

To determine Euler numbers modulo powers of two seems to be a difficult task. In this paper we achieve this and apply the explicit congruence to give a new proof of a classical result due to M. A. Stern.

متن کامل

q-EULER AND GENOCCHI NUMBERS

Carlitz has introduced an interesting q-analogue of Frobenius-Euler numbers in [4]. He has indicated a corresponding Stadudt-Clausen theorem and also some interesting congruence properties of the q-Euler numbers. In this paper we give another construction of q-Euler numbers, which are different than his q-Euler numbers. By using our q-Euler numbers, we define the q-analogue of Genocchi numbers ...

متن کامل

Multiple Product Modulo Arbitrary Numbers

Let n binary numbers of length n be given. The Boolean function ``Multiple Product'' MPn asks for (some binary representation of ) the value of their product. It has been shown (K.-Y. Siu and V. Roychowdhury, On optimal depth threshold circuits for multiplication and related problems, SIAM J. Discrete Math. 7, 285 292 (1994)) that this function can be computed in polynomial-size threshold circu...

متن کامل

Catalan Numbers Modulo 2 k

In this paper, we develop a systematic tool to calculate the congruences of some combinatorial numbers involving n!. Using this tool, we re-prove Kummer’s and Lucas’ theorems in a unique concept, and classify the congruences of the Catalan numbers cn (mod 64). To achieve the second goal, cn (mod 8) and cn (mod 16) are also classified. Through the approach of these three congruence problems, we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Japan Academy. Series A, Mathematical sciences

سال: 2022

ISSN: ['0386-2194']

DOI: https://doi.org/10.3792/pjaa.98.012